Partitions and Permutation Groups
نویسندگان
چکیده
We show that non-trivial extremely amenable topological groups are essentially the same thing as permutation models of the Boolean prime ideal theorem that do not satisfy the axiom of choice. Both are described in terms of partition properties of group actions.
منابع مشابه
Crested Products of Association Schemes
In this paper, we define a new type of product of association schemes (and of the related objects, permutation groups and orthogonal block structures), which generalizes the direct and wreath products (which are referred to as “crossing” and “nesting” in the statistical literature.) Given two association schemes Qr for r = 1, 2, each having an inherent partition Fr (that is, a partition whose e...
متن کاملAsymptotics of Plancherel Measures for Symmetric Groups
1.1. Plancherel measures. Given a finite group G, by the corresponding Plancherel measure we mean the probability measure on the set G∧ of irreducible representations of G which assigns to a representation π ∈ G∧ the weight (dim π)/|G|. For the symmetric group S(n), the set S(n)∧ is the set of partitions λ of the number n, which we shall identify with Young diagrams with n squares throughout th...
متن کاملLinked Partitions and Permutation Tableaux
Linked partitions were introduced by Dykema in the study of transforms in free probability theory, whereas permutation tableaux were introduced by Steingŕımsson and Williams in the study of totally positive Grassmannian cells. Let [n] = {1, 2, . . . , n}. Let L(n, k) denote the set of linked partitions of [n] with k blocks, let P (n, k) denote the set of permutations of [n] with k descents, and...
متن کاملCharacterization of association schemes by equitable partitions
In this paper we deal with equitable partitions of association schemes. We try to generalize a result in group theory and show examples that a generalization of a certain property conjectured for permutation groups does not hold for association schemes. © 2004 Elsevier Ltd. All rights reserved.
متن کاملGeneralised Pattern Avoidance
Recently, Babson and Steingŕımsson have introduced generalised permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We will consider pattern avoidance for such patterns, and give a complete solution for the number of permutations avoiding any single pattern of length three with exactly one adjacent pair of letters. For eight...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011